Error Recovery Properties and Soft Decoding of Quasi-Arithmetic Codes
نویسندگان
چکیده
منابع مشابه
Error Recovery Properties and Soft Decoding of Quasi-Arithmetic Codes
This paper first introduces a new set of aggregated state models for soft-input decoding of quasi arithmetic (QA) codes with a termination constraint. The decoding complexity with these models is linear with the sequence length. The aggregation parameter controls the tradeoff between decoding performance and complexity. It is shown that close-to-optimal decoding performance can be obtained with...
متن کاملSoft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes
The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source. The approximation of the source distribution leads to the introduction of redundancy that can be exploited for robust decoding in presence of ...
متن کاملAdaptive Heuristic Search for Soft-Input Soft-Output Decoding of Arithmetic Codes
Arithmetic coding for data compression has gained widespread acceptance for optimum compression when used in a suitable model. The "traditional" hard bit based decoding suffers from severe loss of data when errors are present in the received bitstream. In this paper, heuristic-search based algorithms are introduced for the decoding of arithmetic coded bitstreams. They utilize both channel "soft...
متن کاملSoft decoding and synchronization of arithmetic codes: application to image transmission over noisy channels
This paper addresses the issue of robust and joint source-channel decoding of arithmetic codes. We first analyze dependencies between the variables involved in arithmetic coding by means of the Bayesian formalism. This provides a suitable framework for designing a soft decoding algorithm that provides high error-resilience. It also provides a natural setting for "soft synchronization", i.e., to...
متن کاملOn the decoding of quasi-BCH codes
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2007
ISSN: 1687-6180
DOI: 10.1155/2008/752840